Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networks

This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks (MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained nodes share limited bandwidth to send their packets destinations. have transmission range they rely deliver packets. Hence, must be associated with required (i.e., optimum) neighbors. As is varied, trade-off exists between network connectivity available per node. To investigate this issue, we consider Dynamic Source Routing (DSR) as routing protocol IEEE 802.11 MAC layer in work. We both static dynamic scenarios simulated via simulator (NS-2) simulation results show that there case. also mobility has grave impact performance terms throughput, end-to-end delay, energy consumption, packet loss. need increase under conditions. However, no global